Huffman coding
英
美 [ˈhʌfmən ˈkoʊdɪŋ]
网络 哈夫曼编码; 霍夫曼编码; HUFFMAN编码; 赫夫曼编码; 霍夫曼编码法
双语例句
- The gzip compressor is based on the DEFLATE lossless data compression algorithm, which uses a combination of the LZ77 algorithm and Huffman coding.
gzip压缩器基于DEFLATE无损数据压缩算法，它使用LZ77算法和Huffman编码的组合。 - In XGrind, element and attribute names are encoded using a dictionary-based encoding scheme, and character data is compressed using semi-adaptive Huffman coding.
在XGrind中，元素和属性名称使用基于词典的编码方案进行编码，字符数据通过半自适应Huffman编码进行压缩。 - Huffman coding uses a specific method for choosing the representation for each symbol where the most common characters using shorter strings of bits then are used for less common source symbols.
Huffman编码使用一种特定方法选择每个符号的表示，使用当时短位字符串的最常见的字符被使用，而不使用不常见的源符号。 - A sort-once and dynamic encoding ( sode) based Huffman coding algorithm
基于一次排序动态编码的Huffman编码算法 - Application of Multiple Huffman Coding in Encryption
多元哈夫曼编码在加密技术中的应用 - Huffman Coding Based on a Top-Down Approach
一种基于自顶向下的哈夫曼编码方法 - Huffman coding is widely used, such as JPEG in the application of the Huffman coding.
哈夫曼编码是哈夫曼树的一个应用。哈夫曼编码应用广泛，如JPEG中就应用了哈夫曼编码。 - In the Huffman coding based on the decoding, you can restore the compressed data.
在哈夫曼编码的基础上进行解码，就可以还原压缩的数据。 - In the computer information processing," Huffman coding "is a consistent coding method ( also known as" entropy coding method") for lossless data compression.
在计算机信息处理中，“哈夫曼编码”是一种一致性编码法（又称“熵编码法”），用于数据的无损耗压缩。 - IC image compressing technology based on energy entropy distribution gradient and huffman coding
基于能量熵分布梯度与Huffman编码的IC图像压缩技术 - A code compression approach combining the type model and the traditional position model and a corresponding low-overhead decompression hardware architecture using Huffman coding were also presented.
提出了一种使用混合模型，采用霍夫曼编码的代码压缩方法以及相应的低开销硬件解压缩实现方案。 - An upward stroke from the tip to the heel of the bow. Huffman Coding Based on a Top-Down Approach
一种从顶部到腰后部的向上手法。一种基于自顶向下的哈夫曼编码方法 - Generally, the storage of Huffman coding and the way of creating Huffman tree, which not only influence the coding efficiency, but also do not fully make use of the storage space.
一般情况下，哈夫曼编码所采用的存储结构及构树方法，不仅影响编码效率，而且也没充分利用存储空间。 - Huffman coding was used to compress these high rate 1-bit code streams in this paper.
采用Huffman编码方式对高速1bit流进行压缩。 - The fourth chapter discusses the Huffman coding method, anticipating coding method and wavelet transform coding method used in this paper.
第四章讨论了课题中采用的霍夫曼编码、预测编码和小波变换编码的理论和方法。 - Huffman coding is one of popular algorithms for file compression.
Huffman编码是压缩文件的一种常用算法。 - This approach uses prediction to reduce the redundancy and classical Huffman coding to reduce the average code length.
该方法应用线性预测原理减少数据的冗余度并应用Huffman编码以实现最佳平均码长。 - Based on the grouping Huffman coding method a more efficient coding method, i.e. adaptive grouping Huffman is presented.
在分组霍夫曼编码的基础上提出了一种更有效的编码方法，即自适应分组霍夫曼编码方法。 - The theory of self-adaptive Huffman coding algorithm is introduced.
介绍了自适应Huffman编码算法的原理。 - First, a word-based Huffman compression algorithm is introduced. The construction algorithm of multi-fork tree is presented and demonstrated by an example. Two kinds of Huffman coding trees with different breadths are compared.
介绍了基于单词的Huffman压缩算法，给出了多叉Huffman树的构造算法，用一个例子进行了说明，比较了两种不同宽度的Huffman编码树。 - Based on the idea of Huffman coding, Huffman-based Certificate Revocation Tree ( H-CRT) is proposed.
基于Huffman编码的思想，提出了一种基于Huffman的证书撤销树（HCRT）。 - This paper describes some methods on optimizing parallel processing and data structure for DCT, quantization, and Huffman coding of JPEG algorithm with parallel instruction of 32 bits fixed point processors, in order to develop its parallel processing capability effectively.
本文结合指令级并行32位定点处理器的结构特点，对JPEG算法中DCT、量化及Huffman编码等步骤，提出一些适于并行处理算法和数据结构的优化方法，以有效发挥其高速并行的性能。 - Afterward, for at present in common use Huffman coding, run length encoding, N order context adaptive arithmetic encoding, DPCM coding etc. four kinds of static image compression methods make compare and analysis.
然后对目前常用的Huffman编码，行程编码，算术编码、DPCM编码等四种静态图像压缩方法进行了比较与分析。 - Discuss on the principle of data compress. Study and analyze the classical algorithm used in multimedia, such as Run-Length coding, Huffman coding, arithmetic coding, transform coding. 4.
分析了多媒体数据进行压缩的必要性和可行性，讨论了数据压缩的基本原理，研究和分析了多媒体数据压缩常用的算法，如行程编码、霍夫曼编码、算术编码、变换编码等。 - Most important of all, the paper studies the parallel DCT transformation which can be applied based on GPU and analyzes the parallel Huffman coding method.
其中，最为重要的是研究了适合在GPU上实现的可并行DCT变换方法，并且对于熵编码，也分析了Huffman编码方法。 - Obviously, dynamic Huffman coding has good applicability and can be used on Symbian platform widely.
可见，动态哈夫曼编码在Symbian平台上具体广泛和良好的适用性。 - The low-frequency coefficients of wavelet transform can be well compressed by Huffman coding.
对小波变换后的低频系数进行Huffman编码的方法也可以有效的提高数据压缩率。 - It is the betterment of Huffman coding and approach to the lossless compression coding limit.
自适应算术编码克服了霍夫曼编码的缺点，可以更逼近无损压缩编码的极限。 - Huffman coding implementation uses a parallel look-up table manner, increase the speed of the encoding.
哈夫曼编码的实现采用并行查表的方式，提高编码的速度。 - The shorter signature is obtained by quantization and Huffman coding.
利用量化和huffman编码压缩得到较短的签名。